0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.36	% Computer   : n007.cluster.edu
0.15/0.36	% Model      : x86_64 x86_64
0.15/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory     : 8042.1875MB
0.15/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 1200
0.15/0.36	% WCLimit    : 120
0.15/0.36	% DateTime   : Tue Jul 13 15:46:34 EDT 2021
0.15/0.36	% CPUTime    : 
0.15/0.36	% Number of cores: 8
0.15/0.36	% Python version: Python 3.6.8
0.15/0.37	# Version: 2.6rc1-ho
0.15/0.38	# No SInE strategy applied
0.15/0.38	# Trying AutoSched0 for 59 seconds
0.23/0.47	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.23/0.47	# and selection function SelectComplexExceptUniqMaxHorn.
0.23/0.47	#
0.23/0.47	# Preprocessing time       : 0.061 s
0.23/0.47	# Presaturation interreduction done
0.23/0.47	
0.23/0.47	# Proof found!
0.23/0.47	# SZS status Theorem
0.23/0.47	# SZS output start CNFRefutation
0.23/0.47	thf(fact_19_cset__nondetM__base_Oaltc__nondet__def, axiom, (monomo463139869_c_m_a)=(^[X328:countable_Set_cset_c > (c > m) > m, X47:countable_Set_cset_c, X329:c > monomo197243225tT_a_m]:monomo412532791tT_m_a @ (X328 @ X47 @ (comp_M750374444_m_m_c @ monomo624345106et_a_m @ X329))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_19_cset__nondetM__base_Oaltc__nondet__def)).
0.23/0.47	thf(fact_25_comp__def, axiom, (comp_M750374444_m_m_c)=(^[X35:monomo197243225tT_a_m > m, X45:c > monomo197243225tT_a_m, X46:c]:X35 @ (X45 @ X46)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_25_comp__def)).
0.23/0.47	thf(fact_0_mergec__single, axiom, ![X381:c, X382:c > m]:(mergec @ (counta472291938sert_c @ X381 @ bot_bo1320844070cset_c) @ X382)=(X382 @ X381), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_mergec__single)).
0.23/0.47	thf(fact_86_nondetT_Oexhaust__sel, axiom, ![X134:monomo197243225tT_a_m]:(X134)=(monomo412532791tT_m_a @ (monomo624345106et_a_m @ X134)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_86_nondetT_Oexhaust__sel)).
0.23/0.47	thf(conj_0, conjecture, (monomo463139869_c_m_a @ mergec @ (counta472291938sert_c @ x @ bot_bo1320844070cset_c) @ f)=(f @ x), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
0.23/0.47	thf(c_0_5, plain, ![X328:countable_Set_cset_c > (c > m) > m, X47:countable_Set_cset_c, X329:c > monomo197243225tT_a_m]:(monomo463139869_c_m_a @ X328 @ X47 @ X329)=(monomo412532791tT_m_a @ (X328 @ X47 @ (comp_M750374444_m_m_c @ monomo624345106et_a_m @ X329))), inference(fof_simplification,[status(thm)],[fact_19_cset__nondetM__base_Oaltc__nondet__def])).
0.23/0.47	thf(c_0_6, plain, ![X35:monomo197243225tT_a_m > m, X45:c > monomo197243225tT_a_m, X46:c]:(comp_M750374444_m_m_c @ X35 @ X45 @ X46)=(X35 @ (X45 @ X46)), inference(fof_simplification,[status(thm)],[fact_25_comp__def])).
0.23/0.47	thf(c_0_7, plain, ![X2269:countable_Set_cset_c > (c > m) > m, X2270:countable_Set_cset_c, X2271:c > monomo197243225tT_a_m]:(monomo463139869_c_m_a @ X2269 @ X2270 @ X2271)=(monomo412532791tT_m_a @ (X2269 @ X2270 @ (comp_M750374444_m_m_c @ monomo624345106et_a_m @ X2271))), inference(variable_rename,[status(thm)],[c_0_5])).
0.23/0.47	thf(c_0_8, plain, ![X2351:c, X2352:c > m]:(mergec @ (counta472291938sert_c @ X2351 @ bot_bo1320844070cset_c) @ X2352)=(X2352 @ X2351), inference(variable_rename,[status(thm)],[fact_0_mergec__single])).
0.23/0.47	thf(c_0_9, plain, ![X1772:monomo197243225tT_a_m > m, X1773:c > monomo197243225tT_a_m, X1774:c]:(comp_M750374444_m_m_c @ X1772 @ X1773 @ X1774)=(X1772 @ (X1773 @ X1774)), inference(variable_rename,[status(thm)],[c_0_6])).
0.23/0.47	thf(c_0_10, plain, ![X2770:monomo197243225tT_a_m]:(X2770)=(monomo412532791tT_m_a @ (monomo624345106et_a_m @ X2770)), inference(variable_rename,[status(thm)],[fact_86_nondetT_Oexhaust__sel])).
0.23/0.47	thf(c_0_11, negated_conjecture, (monomo463139869_c_m_a @ mergec @ (counta472291938sert_c @ x @ bot_bo1320844070cset_c) @ f)!=(f @ x), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.23/0.47	thf(c_0_12, plain, ![X191:countable_Set_cset_c > (c > m) > m, X7:countable_Set_cset_c, X5:c > monomo197243225tT_a_m]:(monomo463139869_c_m_a @ X191 @ X7 @ X5)=(monomo412532791tT_m_a @ (X191 @ X7 @ (comp_M750374444_m_m_c @ monomo624345106et_a_m @ X5))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.23/0.47	thf(c_0_13, plain, ![X6:c > m, X17:c]:(mergec @ (counta472291938sert_c @ X17 @ bot_bo1320844070cset_c) @ X6)=(X6 @ X17), inference(split_conjunct,[status(thm)],[c_0_8])).
0.23/0.47	thf(c_0_14, plain, ![X1:monomo197243225tT_a_m > m, X5:c > monomo197243225tT_a_m, X17:c]:(comp_M750374444_m_m_c @ X1 @ X5 @ X17)=(X1 @ (X5 @ X17)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.23/0.47	thf(c_0_15, plain, ![X37:monomo197243225tT_a_m]:(X37)=(monomo412532791tT_m_a @ (monomo624345106et_a_m @ X37)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.23/0.47	thf(c_0_16, negated_conjecture, (monomo463139869_c_m_a @ mergec @ (counta472291938sert_c @ x @ bot_bo1320844070cset_c) @ f)!=(f @ x), inference(split_conjunct,[status(thm)],[c_0_11])).
0.23/0.47	thf(c_0_17, plain, ![X5:c > monomo197243225tT_a_m, X17:c]:(monomo463139869_c_m_a @ mergec @ (counta472291938sert_c @ X17 @ bot_bo1320844070cset_c) @ X5)=(X5 @ X17), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14]), c_0_15])).
0.23/0.47	thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])]), ['proof']).
0.23/0.47	# SZS output end CNFRefutation
0.23/0.47	# Proof object total steps             : 19
0.23/0.47	# Proof object clause steps            : 7
0.23/0.47	# Proof object formula steps           : 12
0.23/0.47	# Proof object conjectures             : 4
0.23/0.47	# Proof object clause conjectures      : 2
0.23/0.47	# Proof object formula conjectures     : 2
0.23/0.47	# Proof object initial clauses used    : 5
0.23/0.47	# Proof object initial formulas used   : 5
0.23/0.47	# Proof object generating inferences   : 1
0.23/0.47	# Proof object simplifying inferences  : 4
0.23/0.47	# Training examples: 0 positive, 0 negative
0.23/0.47	# Parsed axioms                        : 353
0.23/0.47	# Removed by relevancy pruning/SinE    : 0
0.23/0.47	# Initial clauses                      : 504
0.23/0.47	# Removed in clause preprocessing      : 76
0.23/0.47	# Initial clauses in saturation        : 428
0.23/0.47	# Processed clauses                    : 711
0.23/0.47	# ...of these trivial                  : 79
0.23/0.47	# ...subsumed                          : 228
0.23/0.47	# ...remaining for further processing  : 404
0.23/0.47	# Other redundant clauses eliminated   : 103
0.23/0.47	# Clauses deleted for lack of memory   : 0
0.23/0.47	# Backward-subsumed                    : 0
0.23/0.47	# Backward-rewritten                   : 4
0.23/0.47	# Generated clauses                    : 580
0.23/0.47	# ...of the previous two non-trivial   : 368
0.23/0.47	# Contextual simplify-reflections      : 4
0.23/0.47	# Paramodulations                      : 459
0.23/0.47	# Factorizations                       : 0
0.23/0.47	# NegExts                              : 0
0.23/0.47	# Equation resolutions                 : 106
0.23/0.47	# Propositional unsat checks           : 0
0.23/0.47	#    Propositional check models        : 0
0.23/0.47	#    Propositional check unsatisfiable : 0
0.23/0.47	#    Propositional clauses             : 0
0.23/0.47	#    Propositional clauses after purity: 0
0.23/0.47	#    Propositional unsat core size     : 0
0.23/0.47	#    Propositional preprocessing time  : 0.000
0.23/0.47	#    Propositional encoding time       : 0.000
0.23/0.47	#    Propositional solver time         : 0.000
0.23/0.47	#    Success case prop preproc time    : 0.000
0.23/0.47	#    Success case prop encoding time   : 0.000
0.23/0.47	#    Success case prop solver time     : 0.000
0.23/0.47	# Current number of processed clauses  : 113
0.23/0.47	#    Positive orientable unit clauses  : 48
0.23/0.47	#    Positive unorientable unit clauses: 0
0.23/0.47	#    Negative unit clauses             : 5
0.23/0.47	#    Non-unit-clauses                  : 60
0.23/0.47	# Current number of unprocessed clauses: 275
0.23/0.47	# ...number of literals in the above   : 635
0.23/0.47	# Current number of archived formulas  : 0
0.23/0.47	# Current number of archived clauses   : 194
0.23/0.47	# Clause-clause subsumption calls (NU) : 5429
0.23/0.47	# Rec. Clause-clause subsumption calls : 4058
0.23/0.47	# Non-unit clause-clause subsumptions  : 149
0.23/0.47	# Unit Clause-clause subsumption calls : 200
0.23/0.47	# Rewrite failures with RHS unbound    : 0
0.23/0.47	# BW rewrite match attempts            : 59
0.23/0.47	# BW rewrite match successes           : 14
0.23/0.47	# Condensation attempts                : 0
0.23/0.47	# Condensation successes               : 0
0.23/0.47	# Termbank termtop insertions          : 43574
0.23/0.47	
0.23/0.47	# -------------------------------------------------
0.23/0.47	# User time                : 0.098 s
0.23/0.47	# System time              : 0.012 s
0.23/0.47	# Total time               : 0.110 s
0.23/0.47	# Maximum resident set size: 2476 pages
0.23/0.48	EOF